On Constructive Connectives and Systems

نویسندگان

  • Arnon Avron
  • Ori Lahav
چکیده

Canonical inference rules and canonical systems are defined in the framework of non-strict single-conclusion sequent systems, in which the succeedents of sequents can be empty. Important properties of this framework are investigated, and a general nondeterministic Kripke-style semantics is provided. This general semantics is then used to provide a constructive (and very natural), sufficient and necessary coherence criterion for the validity of the strong cut-elimination theorem in such a system. These results suggest new syntactic and semantic characterizations of basic constructive connectives.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strict Canonical Constructive Systems

We define the notions of a canonical inference rule and a canonical constructive system in the framework of strict single-conclusion Gentzen-type systems (or, equivalently, natural deduction systems), and develop a corresponding general non-deterministic Kripke-style semantics. We show that every strict constructive canonical system induces a class of non-deterministic Kripke-style frames, for ...

متن کامل

ON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES

Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...

متن کامل

Deriving Natural Deduction Rules from Truth Tables

We develop a general method for deriving natural deduction rules from the truth table for a connective. The method applies to both constructive and classical logic. This implies we can derive “constructively valid” rules for any (classical) connective. We show this constructive validity by giving a general Kripke semantics, that is shown to be sound and complete for the constructive rules. For ...

متن کامل

On the definition of the classical connectives and quantifiers

Classical logic is embedded into constructive logic, through a definition of the classical connectives and quantifiers in terms of the constructive ones. The history of the notion of constructivity started with a dispute on the deduction rules that one should or should not use to prove a theorem. Depending on the rules accepted by the ones and the others, the proposition P ∨ ¬P , for instance, ...

متن کامل

Basic Constructive Connectives, Determinism and Matrix-Based Semantics

(Non-)deterministic Kripke-style semantics is used to characterize two syntactic properties of single-conclusion canonical sequent calculi: invertibility of rules and axiom-expansion. An alternative matrixbased formulation of such semantics is introduced, which provides an algorithm for checking these properties, and also new insights into basic constructive connectives.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Logical Methods in Computer Science

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2010